Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4
نویسندگان
چکیده
Tutte’s 5-Flow Conjecture from 1954 states that every bridgeless graph has a nowhere-zero 5-flow. In 2004, Kochol proved that the conjecture is equivalent to its restriction on cyclically 6-edge connected cubic graphs. We prove that every cyclically 6-edge-connected cubic graph with oddness at most 4 has a nowhere-zero 5-flow.
منابع مشابه
Nowhere-zero 5-flows
We prove that every cyclically 6-edge-connected cubic graph with oddness at most 4 has a nowhere-zero 5-flow. Therefore, a possible minimum counterexample to the 5-flow conjecture has oddness at least 6.
متن کاملCubic Graphs without a Petersen Minor Have Nowhere–zero 5–flows
We show that every bridgeless cubic graph without a Petersen minor has a nowhere-zero 5-flow. This approximates the known 4-flow conjecture of Tutte. A graph has a nowhere-zero k-flow if its edges can be oriented and assigned nonzero elements of the group Zk so that the sum of the incoming values equals the sum of the outcoming ones for every vertex of the graph. An equivalent definition we get...
متن کاملParity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow
A parity subgraph of a graph is a spanning subgraph such that the degrees of all vertices have the same parity in both the subgraph and the original graph. Let G be a cyclically 6-edge-connected cubic graph. Steffen (Intersecting 1-factors and nowhere-zero 5-flows 1306.5645, 2013) proved that G has a nowhere-zero 5-flow if G has two perfect matchings with at most two intersections. In this pape...
متن کاملForbidden graphs and group connectivity
Many researchers have devoted themselves to the study of nowhere-zero flows and group connectivity. Recently, Thomassen confirmed the weak 3-flow conjecture, which was further improved by Lovász, Thomassen, Wu and Zhang who proved that every 6-edge-connected graph is Z3-connected. However, Conjectures 1 and 2 are still open. Conjecture 2 implies Conjecture 1 by a result of Kochol that reduces C...
متن کاملOn flows in bidirected graphs
Bouchet conjectured that every bidirected graph which admits a nowhere-zero bidirected flow will admit a nowhere-zero bidirected 6-flow [A. Bouchet, Nowhere-zero integer flows on a bidirected graph, J. Combin. Theory Ser. B 34 (1983) 279–292]. He proved that this conjecture is true with 6 replaced by 216. Zyka proved in his Ph.D dissertation that it is true with 6 replaced by 30. Khelladi prove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 85 شماره
صفحات -
تاریخ انتشار 2017